Noise in Grover’s quantum search algorithm
نویسندگان
چکیده
منابع مشابه
Fixed Phase Quantum Search Algorithm
Building quantum devices using fixed operators is a must to simplify the hardware construction. Quantum search engine is not an exception. In this paper, a fixed phase quantum search algorithm will be presented. Selecting phase shifts of 1.825π in the standard amplitude amplification will make the technique perform better so as to get probability of success at least 98% in O ( √
متن کاملNoise effects in the quantum search algorithm from the computational complexity point of view
It is often said that the strength of quantum computation lies in the phenomena of quantum superposition and quantum entanglement. These features of quantum computation allow to perform the computation on all possible inputs that fit to the quantum register. One of the greatest achievements in the theory of quantum algorithms is quantum search algorithm introduced by Grover. The detailed descri...
متن کاملNoise effects in the quantum search algorithm from the viewpoint of computational complexity
It is often said that the strength of quantum computation lies in the phenomena of quantum superposition and quantum entanglement. These features of quantum computation allow performing the computation on all possible inputs that fit the quantum register. One of the greatest achievements in the theory of quantum algorithms is the quantum search algorithm introduced by Grover. A detailed descrip...
متن کامل0 v 3 9 N ov 1 99 9 Noise in Grover ’ s Quantum Search Algorithm
Grover's quantum algorithm improves any classical search algorithm. We show how random Gaussian noise at each step of the algorithm can be modelled easily because of the exact recursion formulas available for computing the quantum amplitude in Grover's algorithm. We study the algorithm's intrinsic robustess when no quantum correction codes are used, and evaluate how much noise the algorithm can...
متن کاملTradeoffs in the Quantum Search Algorithm
Quantum search is a quantum mechanical technique for searching N possibilities in only √ N steps. This has been proved to be the best possible algorithm for the exhuastive search problem in the sense the number of queries it requires cannot be reduced. However, as this paper shows, the number of non-query operations, and thus the total number of operations, can be reduced. The number of non-que...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 1999
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.61.012301